THE GLOBAL DOMINATION NUMBER IN PRODUCT FUZZY GRAPHS

نویسندگان

چکیده

In this paper we introduced the concepts of global domination number and domatic in product fuzzy graph is denoted by γg(G) dg(G), respectively determine for several classes obtain Nordhaus-Gaddum type results parameter. Further, some bounds dg(G) are investigated. Also relations between γg(G)(dg(G)) other known parameter Product graphs Finally introduce concept full about done.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the geodetic domination number for the product of graphs

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...

متن کامل

On the super domination number of graphs

The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...

متن کامل

Total Roman domination subdivision number in graphs

A {em Roman dominating function} on a graph $G$ is a function $f:V(G)rightarrow {0,1,2}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$. A {em total Roman dominating function} is a Roman dominating function with the additional property that the subgraph of $G$ induced by the set of all vertices of positive weight has n...

متن کامل

global minus domination in graphs

a function $f:v(g)rightarrow {-1,0,1}$ is a {em minusdominating function} if for every vertex $vin v(g)$, $sum_{uinn[v]}f(u)ge 1$. a minus dominating function $f$ of $g$ is calleda {em global minus dominating function} if $f$ is also a minusdominating function of the complement $overline{g}$ of $g$. the{em global minus domination number} $gamma_{g}^-(g)$ of $g$ isdefined as $gamma_{g}^-(g)=min{...

متن کامل

Domination and Signed Domination Number of Cayley Graphs

In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Mathematics and Statistics

سال: 2023

ISSN: ['0973-8347']

DOI: https://doi.org/10.53555/eijms.v6i1.45